“BEST POSSIBLE” UPPER AND LOWER BOUNDS FOR THE ZEROS OF THE BESSEL FUNCTION Jν(x)
نویسنده
چکیده
Let jν,k denote the k-th positive zero of the Bessel function Jν(x). In this paper, we prove that for ν > 0 and k = 1, 2, 3, . . . , ν − ak 21/3 ν < jν,k < ν − ak 21/3 ν + 3 20 ak 21/3 ν1/3 . These bounds coincide with the first few terms of the well-known asymptotic expansion jν,k ∼ ν − ak 21/3 ν + 3 20 ak 21/3 ν1/3 + · · · as ν →∞, k being fixed, where ak is the k-th negative zero of the Airy function Ai(x), and so are “best possible”.
منابع مشابه
Bounds for the small real and purely imaginary zeros of Bessel and related functions
We give two distinct approaches to finding bounds, as functions of the order ν, for the smallest real or purely imaginary zero of Bessel and some related functions. One approach is based on an old method due to Euler, Rayleigh, and others for evaluating the real zeros of the Bessel function Jν(x) when ν > −1. Here, among other things, we extend this method to get bounds for the two purely imagi...
متن کاملOn the Localization and Computation of Zeros of Bessel Functions
The topological degree of a continuous mapping is implemented for the calculation of the total number of the simple real zeros within any interval of the Bessel functions of first and second kind and their derivatives. A new algorithm, based on this implementation, is given for the localization and isolation of these zeros. Furthermore, a second algorithm is presented for their computation empl...
متن کاملSharp Bounds on the PI Spectral Radius
In this paper some upper and lower bounds for the greatest eigenvalues of the PI and vertex PI matrices of a graph G are obtained. Those graphs for which these bounds are best possible are characterized.
متن کاملBounds for Extreme Zeros of Quasi–orthogonal Ultraspherical Polynomials
We discuss and compare upper and lower bounds obtained by two different methods for the positive zero of the ultraspherical polynomial C n that is greater than 1 when −3/2 < λ <−1/2. Our first approach uses mixed three term recurrence relations and interlacing of zeros while the second approach uses a method going back to Euler and Rayleigh and already applied to Bessel functions and Laguerre a...
متن کاملEstimating Upper and Lower Bounds For Industry Efficiency With Unknown Technology
With a brief review of the studies on the industry in Data Envelopment Analysis (DEA) framework, the present paper proposes inner and outer technologies when only some basic information is available about the technology. Furthermore, applying Linear Programming techniques, it also determines lower and upper bounds for directional distance function (DDF) measure, overall and allocative efficienc...
متن کامل